332A - Down the Hatch - CodeForces Solution


implementation *1300

Please click on ads to support us..

C++ Code:

#include <cstdio>
#include <iostream>

int main(){

    int n; scanf("%d\n", &n);
    std::string line(""); int total(0);
    getline(std::cin, line);
    for(int k = n; k < line.size(); k += n){if(line[k - 1] == line[k - 2] && line[k-2] == line[k-3]){++total;}}
    printf("%d\n", total);
    return 0;
}
 		 	 	  	  			   	 	  	    		
  	 		 		        		   		    			


Comments

Submit
0 Comments
More Questions

1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)
1579A - Casimir's String Solitaire
287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset